On polynomial growth functions of D0L-systems

نویسندگان

  • Julien Cassaigne
  • François Nicolas
چکیده

The aim of this paper is to prove that every polynomial function that maps the natural integers to the positive integers is the growth function of some D0L-system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Watson-Crick D0L Systems

D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...

متن کامل

About Digital Images and Lindenmayer Systems

In this paper, we are studying deterministic context free Lindenmayer Systems used to describe commands to a device that generates black and white digital images. Instead of well-known methods of drawing, we will paint squares, not lines. In the final part of the paper, we will discuss some important properties of growth functions of D0L-systems. In addition, we turn the discussion to gray scal...

متن کامل

Iterated Morphisms with Complementarity on the DNA Alphabet

Watson-Crick complementarity can be viewed as a language-theoretic operation: \bad" words obtained through a generative process are replaced by their complementary ones. This idea seems particularly suitable for Lindenmayer systems. D0L systems augmented with a speci c complementarity transition, Watson-Crick D0L systems, have turned out to be a most interesting model and have already been exte...

متن کامل

Uni-transitional Watson-crick D0l Systems Uni-transitional Watson-crick D0l Systems

The phenomenon known as Watson-Crick complementarity is basic both in the experiments and theory of DNA computing. While the massive parallelism of DNA strands makes exhaustive searches possible, complementarity constitutes a powerful computational tool. It is also very fruitful to view complementarity as a language-theoretic operation: \bad" words obtained through a generative process are repl...

متن کامل

Watson-Crick D0L systems: the power of one transition

We investigate the class of functions computable by uni-transitional Watson–Crick D0L systems: only one complementarity transition is possible during each derivation. The class is characterized in terms of a certain min-operation applied to Z-rational functions. We also exhibit functions outside the class, and show that the basic decision problems are equivalent or harder than a celebrated open...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0904.1752  شماره 

صفحات  -

تاریخ انتشار 2009